GPGPU-BASED COLLISION ATTACK ON QURANIC VERSES HASH TABLES
نویسندگان
چکیده
منابع مشابه
Collision Attack on the Waterfall Hash Function
We give a method that appears to be able to find colliding messages for the Waterfall hash function with approximately O(2) work for all hash sizes. If correct, this would show that the Waterfall hash function does not meet the required collision resistance.
متن کاملCache-Conscious Collision Resolution in String Hash Tables
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collision resolution, hash tables scale well, particularly if the pattern of access to the stored strings is skew. However, typical implementations of string hash tables, with lists of nodes, are not cache-efficient. In thi...
متن کاملCollision Attack on 4-Branch, Type-2 GFN Based Hash Functions Using Sliced Biclique Cryptanalysis Technique
In this work, we apply the sliced biclique cryptanalysis technique to show 8-round collision attack on a hash function H based on 4-branch, Type-2 Generalized Feistel Network (Type-2 GFN). This attack is generic and works on 4-branch, Type-2 GFN with any parameters including the block size, type of round function, the number of S-boxes in each round and the number of SP layers inside the round ...
متن کاملA commentary on hunger in Quranic verses
Hunger has been always regarded as one of the signs in mysticism and morality and all Sufis have known it as one of the bases for their special manner of life. Some have known it to mean eating based on need, some other to mean fasting and some to mean not eating but necessarily. The author, as is understood in the paper, relying on Quran and sunnah, has explained that the meanings are intended...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES
سال: 2020
ISSN: 0973-8975,2454-7190
DOI: 10.26782/jmcms.spl.6/2020.01.00004